Calculating Maximum Entropy Flows in Networks
نویسندگان
چکیده
منابع مشابه
Calculating Maximum-Entropy Probability densities for Belief Functions
A common procedure for selecting a particular density from a given class of densities is to choose one with maximum entropy. The problem addressed here is this. Let S be a nite set and let B be a belief function on 2 . Then B induces a density on 2 , which in turn induces a host of densities on S. Provide an algorithm for choosing from this host of densities one with maximum entropy.
متن کاملCredal Networks under Maximum Entropy
We apply the principle of maximum entropy to select a unique joint probability distribution from the set of all joint probability distributions specified by a credal network. In detail, we start by showing that the unique joint distribution of a Bayesian tree coincides with the maximum entropy model of its conditional distributions. This result, however, does not hold anymore for general Bayesi...
متن کاملMaximum Entropy Discrimination Markov Networks
Standard maximum margin structured prediction methods lack a straightforward probabilistic interpretation of the learning scheme and the prediction rule. Therefore its unique advantages such as dual sparseness and kernel tricks cannot be easily conjoined with the merits of a probabilistic model such as Bayesian regularization, model averaging, and ability to model hidden variables. In this pape...
متن کاملOn multiroute maximum flows in networks
Let G = (N, A) be a network with a designated source node s, a designated sink node t, and a finite integral capacity uij < U on each arc (ij) E A. An elementary K-flow is a flow of K units from s to t such that the flow on each arc is 0 or 1. A K-route flow is a flow from s to t that may be expressed as a non-negative linear sum of elementary Kflows. In this paper, we show how to determine a m...
متن کاملMaximum entropy sampling in complex networks
Many real-world systems are characterized by stochastic dynamical rules where a complex network of dependencies among individual elements probabilistically determines their state. Even with full knowledge of the network structure and of the stochastic rules of the dynamical process, the ability to predict system configurations is generally characterized by large uncertainty. Sampling a fraction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 1993
ISSN: 0160-5682,1476-9360
DOI: 10.1057/jors.1993.68